package com.chaos.demo.demo2020.sortDemo;

/**
 * @program: demo
 * * @description:
 * * @author: liaopeng
 * * @create: 2020-04-21 11:17
 **/
public class InsertionSort {
    public static void insertionSort(int [] a){
        if (a.length<=0){return;}
        for (int i = 0; i < a.length; i++) {
            int i1 = a[i];
            for (int j = a.length-1; j >i; j--) {
                if (a[j]<a[i]){
                    int temp = a[i];
                    
                }
            }
        }
    }
}
